A new fractional channel policy

نویسندگان

  • Hamid Beigy
  • Mohammad Reza Meybodi
چکیده

Dropping probability of handoff calls and blocking probability of new calls are two important QoS measures for cellular networks. Since the dropping probability of handoff calls is more important, call admission policies are used to maintain the upper bound of dropping probability of handoff calls. The fractional channel policy (FC) is a general call admission policy and includes most prioritized channel allocation schemes such as guard channel (GC) and limited fractional channel (LFC) policies. In this paper, we introduce a subclass of fractional channel policy, called uniform fractional channel policy (UFC) and study its performance. Expressions for both dropping probability of handoff calls and blocking probability of new calls are derived. Then it is shown that there is an optimal value for the parameter of UFC, which minimizes the blocking probability of new calls with the constraint on the upper bound on the dropping probability of handoff calls. An algorithm for finding the optimal parameter of UFC is also given. Conditions under which the UFC performs better than GC is derived. It is concluded that, the UFC policy performs better than GC policy under the low handoff/new traffic ratio.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Adaptive Uniform Fractional Guard Channel Algorithm: A Learning Automata Approach

In [1], a learning automata (LA) based call admission policy is given which accepts new calls as long as the pre-specified level of QoS is maintained. The simulation results show that this policy cannot maintain the upper bound on the level of QoS. In this paper, we propose a new LA based algorithm in which a L-\ is used to accept/reject ne\v calls. This algorithm can be considered as an adapti...

متن کامل

Adaptive Uniform Fractional Channel Algorithms

Dropping probability of handoff calls and blocking probability of new calls are two important QoS measures for cellular networks. Since the dropping probability of handoff calls is more important, call admission policies are used to maintain the upper bound of dropping probability of handoff calls. The fractional guard channel policy (FG) is a general call admission policy and includes most pri...

متن کامل

On Optimal Call Admission Control in Cellular Networks

Two important Quality-of-Service (QoS) measures for current cellular networks are the fractions of new and handoff “calls” that are blocked due to unavailability of “channels” (radio and/or computing resources). Based on these QoS measures, we derive optimal admission control policies for three problems: minimizing a linear objective function of the new and handoff call blocking probabilities (...

متن کامل

A New Policy Environment to Achieve Monetary Goals

Monetary environment as the core of financial system has been functionally designed in light of the new set of extensive goals including financial stability, sustainable noninflationary growth, external sustainability, and price stability. A comprehensive monetary policy framework is proposed for Iran which systematically include the new goals, stance variables, instruments, transmission mechan...

متن کامل

Solution for a retrial queueing problem in cellular networks with the Fractional Guard Channel policy

In this paper, we introduce a retrial queueing problem for wireless cellular networks applying the Fractional Guard Channel (FGC) admission control policy and propose a new algorithm to solve the retrial queue problem involving the FGC policy. Comparison between analytical and simulation results shows that our algorithm is accurate and fast to evaluate the performance of the system.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • J. High Speed Networks

دوره 13  شماره 

صفحات  -

تاریخ انتشار 2004